Using lotteries to approximate the optimal revenue

There has been much recent work on the revenue-raising properties of truthful mechanisms for selling goods to selfish bidders. Typically the revenue of a mechanism is compared against a benchmark (such as, the maximum revenue obtainable by an omniscient seller selling at a fixed price to at least two customers), with a view to understanding how much lower the mechanism’s revenue is than the benchmark, in the worst case. We study this issue in the context of lotteries, where the seller may sell a probability of winning an item. We are interested in two general issues. Firstly, we aim at using the true optimum revenue as benchmark for our auctions. Secondly, we study the extent to which the expressive power resulting from lotteries, helps to improve the worst-case ratio. We study this in the well-known context of digital goods. We show that in this scenario, collusionresistant lotteries (these are lotteries for which no coalition of bidders exchanging side payments has an advantage in lying) are as powerful as truthful ones.